Oriented Tait graphs
نویسندگان
چکیده
منابع مشابه
New skew equienergetic oriented graphs
Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...
متن کاملMichael Tait: Research Statement
My research uses algebraic and geometric methods to prove theorems in extremal combinatorics. Going the other way, I also use combinatorial methods to prove algebraic results. Algebraic methods are deeply embedded in my work and nearly all of my success in graph theoretic research has come from attacking purely combinatorial problems through the lens of algebra, combinatorial number theory, or ...
متن کاملThe Tait Flyping Conjecture
We announce a proof of the Tait flyping conjecture; the confirmation of this conjecture renders almost trivial the problem of deciding whether two given alternating link diagrams represent equivalent links. The proof of the conjecture also shows that alternating links have no "hidden" symmetries. In the nineteenth century, the celebrated physicist and knot tabulator P. G. Tait proposed the foll...
متن کاملDecomposing oriented graphs into 6 locally irregular oriented graphs
An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪ ...∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently conjectured by Baudon et al. that every undirected graph admits a decomposition into 3 locally irre...
متن کاملDecomposing Oriented Graphs into Six Locally Irregular Oriented Graphs
An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪ ...∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently conjectured by Baudon et al. that every undirected graph admits a decomposition into 3 locally irre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 1973
ISSN: 0004-9735
DOI: 10.1017/s1446788700015135